On Mixed Graphs Whose Hermitian Spectral Radii are at Most 2
نویسندگان
چکیده
منابع مشابه
On graphs whose spectral radius
The structure of graphs whose largest eigenvalue is bounded by 3 2 √ 2 (≈ 2.1312) is investigated. In particular, such a graph can have at most one circuit, and has a natural quipu structure.
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملSpectral Radii of Large Non-Hermitian Random Matrices
By using the independence structure of points following a determinantal point process, we study the radii of the spherical ensemble, the truncation of the circular unitary ensemble and the product ensemble with parameter n and k. The limiting distributions of the three radii are obtained. They are not the Tracy-Widom distribution. In particular, for the product ensemble, we show that the limiti...
متن کاملHermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
Let M be a mixed graph and [Formula: see text] be its Hermitian-adjacency matrix. If we add a Randić weight to every edge and arc in M, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix? Motivated by this, we define the Hermitian-Randić matrix [Formula: see text] of a mixed graph M, where [Formula: see text] ([Formula: see text]) if [Formula: ...
متن کاملEla on the Spectral Radii of Graphs without given Cycles
Let G be a graph with n vertices and ρ(G) be the spectral radius of its adjacency matrix. Write Cl for the cycle of order l and let gl(n) = max{ρ(G) : |V (G)| = n, neither Cl nor Cl+1 is a subgraph of G}. This paper obtains the exact value of g5(n) with the unique extremal graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2020
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02181-w